منابع مشابه
Vector Addition Systems Reachability Problem (A Simpler Solution)
The reachability problem for Vector Addition Systems (VASs) is a central problem of net theory. The general problem is known to be decidable by algorithms based on the classical Kosaraju-Lambert-Mayr-Sacerdote-Tenney decomposition (KLMST decomposition). Recently from this decomposition, we deduced that a final configuration is not reachable from an initial one if and only if there exists a Pres...
متن کاملTowards a Simpler Account of Modules and Generativity: Abstract Types
We present a variant of the explicitly-typed secondorder polymorphic λ-calculus with primitive open existential types, i.e. a collection of more atomic constructs for introduction and elimination of existential types. We equip the language with a call-by-value small-step reduction semantics that enjoys the subject reduction property. Traditional closed existential types can be defined as syntac...
متن کاملAccurate Summation: Towards a Simpler and Formal Proof
This paper provides a simpler proof of the “accurate summation” algorithm proposed by Demmel and Hida in [1]. It also gives improved bounds in some cases, and examples showing that those new bounds are optimal. This simpler proof will be used to obtain a computer-generated proof of Demmel-Hida’s algorithm, using a proof assistant like HOL, PVS or Coq.
متن کاملA Simpler Minimum Spanning
The problem considered here is that of determining whether a given spanning tree is a minimal spanning tree. In 1984, Komll os presented an algorithm which required only a linear number of comparisons, but nonlinear overhead to determine which comparisons to make. We simplify his algorithm and give a linear time procedure for its implementation in the unit cost RAM model. The procedure uses tab...
متن کاملA Simpler Approach Toweighted
In this paper, we analyze the performance of weighted 1 minimization over a non-uniform sparse signal model by extending the “Gaussian width” analysis proposed in [1]. Our results are consistent with those of [7] which are currently the best known ones. However, our methods are less computationally intensive and can be easily extended to signals which have more than two sparsity classes. Finall...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of the American Board of Family Medicine
سال: 2003
ISSN: 1557-2625,1558-7118
DOI: 10.3122/jabfm.16.2.184-b